Anytime and Distributed Approaches for Graph Matching
نویسندگان
چکیده
منابع مشابه
Sensor-Mission Matching: Centralized and Distributed Approaches
A sensor network consists of a large number of small sensing devices that are able to collect information about their surroundings. When such a network is deployed in a field it is usually required to support multiple missions. Hence, schemes that match sensors to missions become necessary. In this paper, we formally define the sensor-mission matching problem and examine two approaches to solve...
متن کاملParallel and Distributed Approaches for Graph Based Semi-supervised Learning
Two approaches for graph based semi-supervised learning are proposed. The first approach is based on iteration of an affine map. A key element of the affine map iteration is sparse matrix-vector multiplication, which has several very efficient parallel implementations. The second approach belongs to the class of Markov Chain Monte Carlo (MCMC) algorithms. It is based on sampling of nodes by per...
متن کاملDistributed Anytime MAP Inference
We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that allows application of the Dantzig-Wolfe decomposition principle. Subprograms are defined over individual edges and can be computed in a distributed manner. This a...
متن کاملDistributed and Scalable Graph Pattern Matching: Models and Algorithms
Graph pattern matching is a fundamental operation for many applications, and it is exhaustively studied in its classical forms. Nevertheless, there are newly emerging applications, like analyzing hyperlinks of the web graph and analyzing associations in a social network, that need to process massive graphs in a timely manner. Regarding the extremely large size of these graphs and knowledge they...
متن کاملAnytime local search for distributed constraint optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ELCVIA Electronic Letters on Computer Vision and Image Analysis
سال: 2016
ISSN: 1577-5097
DOI: 10.5565/rev/elcvia.986